Set graphs. II. Complexity of set graph recognition and similar problems
نویسندگان
چکیده
منابع مشابه
Set graphs. II. Complexity of set graph recognition and similar problems
A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finite set. In this paper, we continue the study of set graphs and related topics, focusing on computational complexity as...
متن کاملThe complexity of dissociation set problems in graphs
A subset of vertices in a graph is called a dissociation set if it induces a subgraph with vertex degree at most 1. A dissociation set D is maximal if no other dissociation set contains D. The complexity of finding a dissociation set of maximum size in line graphs and finding a maximal dissociation set of minimum size in general graphs is considered.
متن کاملar X iv : 1 20 7 . 71 84 v 1 [ cs . D M ] 3 1 Ju l 2 01 2 Set graphs . II . Complexity of set graph recognition and similar problems
A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finite set. In this paper, we continue the study of set graphs and related topics, focusing on computational complexity as...
متن کاملEvery Graph is a Self - Similar Set
In this paper we prove that every graph (in particular S1) is a selfsimilar space and that [0, 1] is a self-similar set that is not the product of topological spaces, answering two questions posed by C. Ruiz and S. Sabogal in [6].
متن کاملGeneralized Set and Graph Packing Problems
Many complex systems that exist in nature and society can be expressed in terms of networks (e.g., social networks, communication networks, biological networks, Web graph, among others). Usually a node represents an entity while an edge represents an interaction between two entities. A community arises in a network when two or more entities have common interests, e.g., related proteins, industr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.06.017